________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:31:44
Input Data from:  dataset157.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,06525
Average f[i]   :4800
Average g[i,j] :2027,45098039216
Total demand   :11130
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 69
> Selected Move:	1550	1	-1	6	5500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1550


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 52
> Selected Move:	2350	1	-1	16	12000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0    >new incumb.: 2350


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 79
> Selected Move:	3020	1	-1	12	16000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0    >new incumb.: 3020


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 86
> Selected Move:	3590	1	-1	9	22000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0    >new incumb.: 3590


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 84
> Selected Move:	3640	3	6	10	21000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0    >new incumb.: 3640


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 86
> Selected Move:	4000	1	-1	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0    >new incumb.: 4000


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 31
> Selected Move:	4000	3	9	6	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 39
> Selected Move:	4060	3	3	15	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  0  1  1  0  0  0    >new incumb.: 4060


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 43
> Selected Move:	3850	3	10	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 60
> Selected Move:	3800	3	6	9	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 46
> Selected Move:	3820	3	3	10	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 40
> Selected Move:	3780	3	9	3	23500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 27
> Selected Move:	4010	3	0	9	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  2  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 44
> Selected Move:	3964	4	9	16	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  1  1  0  1  0  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 55
> Selected Move:	4010	3	9	6	24600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  1  0  1  0  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 65
> Selected Move:	3815	3	6	8	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  1  0  1  0  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 47
> Selected Move:	3785	3	8	4	25100


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  1  0  1  0  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 42
> Selected Move:	3730	3	16	9	24500


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  2  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 67
> Selected Move:	3770	3	4	6	24000


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  2  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 95
> Selected Move:	3790	3	9	0	22500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 83
> Selected Move:	4010	3	1	16	24000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 64
> Selected Move:	4010	3	6	9	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 46
> Selected Move:	3890	3	15	6	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  1  1  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 36
> Selected Move:	3880	3	16	1	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 74
> Selected Move:	3810	3	9	8	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 67
> Selected Move:	3828	3	1	16	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  0  1  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 31
> Selected Move:	3860	3	6	15	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 40
> Selected Move:	3850	3	8	7	25000


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 33
> Selected Move:	3830	3	7	4	24500


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  0  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 50
> Selected Move:	3808	3	15	6	25500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  0  1  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 39
> Selected Move:	3740	3	16	1	24000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 70
> Selected Move:	3740	3	4	14	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 61
> Selected Move:	3830	3	3	15	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 84
> Selected Move:	3770	3	14	9	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 96
> Selected Move:	3760	3	6	8	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 85
> Selected Move:	3760	3	9	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 93
> Selected Move:	3735	3	6	16	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 63
> Selected Move:	3800	3	15	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 45
> Selected Move:	3740	3	8	4	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 40
> Selected Move:	3740	3	16	9	24500


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 60
> Selected Move:	3730	3	1	16	26000


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  0  1  1  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 33
> Selected Move:	3765	3	4	8	26000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  1  1  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 38
> Selected Move:	3710	3	16	1	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 75
> Selected Move:	3680	3	8	5	25000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 83
> Selected Move:	3680	3	9	6	24500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 87
> Selected Move:	3790	3	12	15	25000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 70
> Selected Move:	3780	3	5	16	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 67
> Selected Move:	3630	3	16	9	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  1  0  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 83
> Selected Move:	3740	3	10	12	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 87
> Selected Move:	3818	3	1	16	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  1  0  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 51
> Selected Move:	3860	3	6	17	25500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 38
> Selected Move:	3860	3	9	6	25000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  0  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 72
> Selected Move:	3815	3	17	8	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  0  0  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 47
> Selected Move:	3788	3	8	4	25500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  0  0  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 57
> Selected Move:	3690	3	6	17	25500


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  0  0  0  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 55 #######################


> Neighbours evaluated; 47
> Selected Move:	3718	3	4	8	25500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  0  0  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 56 #######################


> Neighbours evaluated; 38
> Selected Move:	3670	3	8	7	26000


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  0  0  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 57 #######################


> Neighbours evaluated; 59
> Selected Move:	3630	3	7	10	24000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  1  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 58 #######################


> Neighbours evaluated; 84
> Selected Move:	3720	3	15	9	25500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  1  0  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 59 #######################


> Neighbours evaluated; 71
> Selected Move:	3660	3	9	6	25000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 60 #######################


> Neighbours evaluated; 92
> Selected Move:	3735	3	17	19	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  0  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 61 #######################


> Neighbours evaluated; 70
> Selected Move:	3710	3	6	15	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  1  0  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 62 #######################


> Neighbours evaluated; 72
> Selected Move:	3700	3	19	18	25000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  1  0  0  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 63 #######################


> Neighbours evaluated; 65
> Selected Move:	3670	3	18	5	25000


> New Y[]: 
	
	 2  0  4  1  0  1  0  0  0  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 64 #######################


> Neighbours evaluated; 39
> Selected Move:	3640	3	5	11	24500


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  1  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 65 #######################


> Neighbours evaluated; 52
> Selected Move:	3658	3	15	6	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  1  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 66 #######################


> Neighbours evaluated; 55
> Selected Move:	3590	3	16	1	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 67 #######################


> Neighbours evaluated; 88
> Selected Move:	3660	3	11	19	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 68 #######################


> Neighbours evaluated; 93
> Selected Move:	3650	3	6	16	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 69 #######################


> Neighbours evaluated; 70
> Selected Move:	3648	3	19	7	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 70 #######################


> Neighbours evaluated; 54
> Selected Move:	3710	3	10	15	25500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 71 #######################


> Neighbours evaluated; 51
> Selected Move:	3770	3	7	17	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0  0  0  1  0  0  1  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 72 #######################


> Neighbours evaluated; 46
> Selected Move:	3825	3	15	6	25500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 73 #######################


> Neighbours evaluated; 72
> Selected Move:	3815	3	17	9	26000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 74 #######################


> Neighbours evaluated; 42
> Selected Move:	3745	3	3	10	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 75 #######################


> Neighbours evaluated; 46
> Selected Move:	3668	3	9	8	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 76 #######################


> Neighbours evaluated; 50
> Selected Move:	3630	3	8	4	26500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 77 #######################


> Neighbours evaluated; 34
> Selected Move:	3738	3	6	15	25500


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 78 #######################


> Neighbours evaluated; 65
> Selected Move:	3730	3	16	6	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 79 #######################


> Neighbours evaluated; 84
> Selected Move:	3730	3	6	9	25000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 80 #######################


> Neighbours evaluated; 82
> Selected Move:	3680	3	4	14	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 81 #######################


> Neighbours evaluated; 92
> Selected Move:	3640	3	15	3	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 82 #######################


> Neighbours evaluated; 82
> Selected Move:	3630	3	14	15	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 83 #######################


> Neighbours evaluated; 85
> Selected Move:	3760	3	1	8	24600


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  3  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 84 #######################


> Neighbours evaluated; 61
> Selected Move:	3828	3	9	16	25100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  3  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 85 #######################


> Neighbours evaluated; 48
> Selected Move:	3913	3	8	9	25300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  3  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 86 #######################


> Neighbours evaluated; 58
> Selected Move:	3770	3	16	6	24300


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  3  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 87 #######################


> Neighbours evaluated; 86
> Selected Move:	3790	3	9	14	24800


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  3  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 88 #######################


> Neighbours evaluated; 72
> Selected Move:	3760	3	14	8	24100


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 89 #######################


> Neighbours evaluated; 86
> Selected Move:	3730	3	8	4	24600


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 90 #######################


> Neighbours evaluated; 76
> Selected Move:	3699	3	6	9	25100


> New Y[]: 
	
	 2  0  4  1  3  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 91 #######################


> Neighbours evaluated; 57
> Selected Move:	3730	4	4	9	24800


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  0  3  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 92 #######################


> Neighbours evaluated; 79
> Selected Move:	3760	3	4	8	24800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  3  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 93 #######################


> Neighbours evaluated; 95
> Selected Move:	3642	3	9	6	25400


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 94 #######################


> Neighbours evaluated; 56
> Selected Move:	3749	3	8	16	25900


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 95 #######################


> Neighbours evaluated; 42
> Selected Move:	3668	4	6	10	26200


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  3  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 96 #######################


> Neighbours evaluated; 48
> Selected Move:	3642	3	10	8	26100


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 97 #######################


> Neighbours evaluated; 52
> Selected Move:	3717	3	15	10	26100


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  0  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 98 #######################


> Neighbours evaluated; 47
> Selected Move:	3723	3	8	9	26300


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  3  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 99 #######################


> Neighbours evaluated; 50
> Selected Move:	3614	3	16	8	25800


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  3  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 100 #######################


> Neighbours evaluated; 52
> Selected Move:	3670	4	9	8	25600


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  1  1  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 101 #######################


> Neighbours evaluated; 74
> Selected Move:	3602	3	6	16	26600


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  3  1  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 102 #######################


> Neighbours evaluated; 41
> Selected Move:	3532	4	8	9	26800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  1  3  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 103 #######################


> Neighbours evaluated; 38
> Selected Move:	3590	2	8	-1	20800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  3  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 104 #######################


> Neighbours evaluated; 80
> Selected Move:	3590	4	9	3	23000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 105 #######################


> Neighbours evaluated; 70
> Selected Move:	3590	4	3	10	22200


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  3  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 106 #######################


> Neighbours evaluated; 73
> Selected Move:	3590	4	10	12	22700


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  1  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 107 #######################


> Neighbours evaluated; 72
> Selected Move:	3590	4	12	16	20000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  1  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 108 #######################


> Neighbours evaluated; 90
> Selected Move:	3600	1	-1	19	26000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  1  0  1  0  0  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 109 #######################


> Neighbours evaluated; 61
> Selected Move:	3560	3	16	1	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 110 #######################


> Neighbours evaluated; 85
> Selected Move:	3610	3	3	15	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 111 #######################


> Neighbours evaluated; 96
> Selected Move:	3610	3	9	6	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 112 #######################


> Neighbours evaluated; 102
> Selected Move:	3600	3	19	18	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  1  0  1  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 113 #######################


> Neighbours evaluated; 97
> Selected Move:	3650	3	15	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 114 #######################


> Neighbours evaluated; 87
> Selected Move:	3550	3	1	16	26000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  0  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 115 #######################


> Neighbours evaluated; 61
> Selected Move:	3565	3	18	14	26000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  1  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 116 #######################


> Neighbours evaluated; 53
> Selected Move:	3630	3	6	15	25000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  0  1  0  1  0  1  1  3  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 117 #######################


> Neighbours evaluated; 64
> Selected Move:	3619	3	16	9	25300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  3  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 118 #######################


> Neighbours evaluated; 63
> Selected Move:	3620	4	9	14	25300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  1  0  1  0  3  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 119 #######################


> Neighbours evaluated; 86
> Selected Move:	3652	3	14	6	25400


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 120 #######################


> Neighbours evaluated; 64
> Selected Move:	3610	3	9	4	25400


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 121 #######################


> Neighbours evaluated; 67
> Selected Move:	3580	3	6	8	24600


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 122 #######################


> Neighbours evaluated; 77
> Selected Move:	3569	3	4	7	25100


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  3  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 123 #######################


> Neighbours evaluated; 71
> Selected Move:	3529	3	7	14	25100


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  3  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 124 #######################


> Neighbours evaluated; 59
> Selected Move:	3502	3	8	6	25900


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  0  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 125 #######################


> Neighbours evaluated; 50
> Selected Move:	3480	3	14	19	25400


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 126 #######################


> Neighbours evaluated; 48
> Selected Move:	3610	4	6	19	24900


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  0  1  0  0  0  3 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 127 #######################


> Neighbours evaluated; 80
> Selected Move:	3600	3	19	18	25000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  1  0  1  0  0  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 128 #######################


> Neighbours evaluated; 84
> Selected Move:	3570	3	18	5	24200


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 129 #######################


> Neighbours evaluated; 100
> Selected Move:	3601	3	6	16	25200


> New Y[]: 
	
	 2  0  4  1  0  3  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 130 #######################


> Neighbours evaluated; 54
> Selected Move:	3620	3	5	4	25600


> New Y[]: 
	
	 2  0  4  1  3  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 131 #######################


> Neighbours evaluated; 48
> Selected Move:	3545	3	16	8	25100


> New Y[]: 
	
	 2  0  4  1  3  0  0  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 132 #######################


> Neighbours evaluated; 72
> Selected Move:	3480	3	4	1	23000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 133 #######################


> Neighbours evaluated; 81
> Selected Move:	3760	3	0	9	24500


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  2  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 134 #######################


> Neighbours evaluated; 88
> Selected Move:	3750	3	8	14	25000


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  2  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 135 #######################


> Neighbours evaluated; 63
> Selected Move:	3750	4	9	14	24700


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  1  1  0  1  0  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 136 #######################


> Neighbours evaluated; 97
> Selected Move:	3790	3	9	6	24200


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  1  0  1  0  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 137 #######################


> Neighbours evaluated; 95
> Selected Move:	3760	3	14	8	24900


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  2  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 138 #######################


> Neighbours evaluated; 75
> Selected Move:	3730	3	8	4	24500


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 139 #######################


> Neighbours evaluated; 77
> Selected Move:	3730	3	6	9	25000


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 140 #######################


> Neighbours evaluated; 84
> Selected Move:	3702	3	4	6	25200


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  1  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 141 #######################


> Neighbours evaluated; 80
> Selected Move:	3776	3	9	16	25700


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 142 #######################


> Neighbours evaluated; 53
> Selected Move:	3784	3	6	7	25200


> New Y[]: 
	
	 0  3  4  1  0  0  0  2  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 143 #######################


> Neighbours evaluated; 61
> Selected Move:	3668	3	7	4	25500


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  0  1  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 144 #######################


> Neighbours evaluated; 58
> Selected Move:	3606	3	4	14	25200


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  1  0  1  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 145 #######################


> Neighbours evaluated; 68
> Selected Move:	3630	3	16	4	24700


> New Y[]: 
	
	 0  3  4  1  1  0  0  0  0  0  1  0  1  0  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 146 #######################


> Neighbours evaluated; 73
> Selected Move:	3664	3	14	6	25200


> New Y[]: 
	
	 0  3  4  1  1  0  2  0  0  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 147 #######################


> Neighbours evaluated; 62
> Selected Move:	3693	3	4	8	25200


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 148 #######################


> Neighbours evaluated; 75
> Selected Move:	3600	3	6	7	24700


> New Y[]: 
	
	 0  3  4  1  0  0  0  2  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 149 #######################


> Neighbours evaluated; 94
> Selected Move:	3600	3	7	14	24700


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  1  0  1  0  1  0  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 150 #######################


> Neighbours evaluated; 87
> Selected Move:	3580	3	14	4	25000


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  1  0  1  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 151 #######################


> Neighbours evaluated; 70
> Selected Move:	3453	3	8	14	25500


> New Y[]: 
	
	 0  3  4  1  2  0  0  0  0  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 152 #######################


> Neighbours evaluated; 71
> Selected Move:	3538	3	4	6	25700


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  0  1  0  1  0  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 153 #######################


> Neighbours evaluated; 66
> Selected Move:	3537	3	14	19	25200


> New Y[]: 
	
	 0  3  4  1  0  0  2  0  0  0  1  0  1  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 154 #######################


> Neighbours evaluated; 64
> Selected Move:	3673	3	6	16	25100


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  1  0  1  0  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,375

## ITERATION 155 #######################


> Neighbours evaluated; 78
> Selected Move:	3630	3	19	17	24600


> New Y[]: 
	
	 0  3  4  1  0  0  0  0  0  0  1  0  1  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,38

## ITERATION 156 #######################


> Neighbours evaluated; 78
> Selected Move:	3632	3	10	6	25600


> New Y[]: 
	
	 0  3  4  1  0  0  1  0  0  0  0  0  1  0  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 157 #######################


> Neighbours evaluated; 66
> Selected Move:	3640	3	16	0	23500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 158 #######################


> Neighbours evaluated; 97
> Selected Move:	3740	3	15	4	25000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,395

## ITERATION 159 #######################


> Neighbours evaluated; 62
> Selected Move:	3730	3	4	9	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 160 #######################


> Neighbours evaluated; 77
> Selected Move:	3660	3	9	8	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 161 #######################


> Neighbours evaluated; 73
> Selected Move:	3660	3	17	15	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 162 #######################


> Neighbours evaluated; 80
> Selected Move:	3680	3	8	4	24000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 163 #######################


> Neighbours evaluated; 80
> Selected Move:	3680	3	6	7	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 164 #######################


> Neighbours evaluated; 67
> Selected Move:	3680	3	7	16	25000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 165 #######################


> Neighbours evaluated; 41
> Selected Move:	3650	3	4	8	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 166 #######################


> Neighbours evaluated; 41
> Selected Move:	3640	3	16	7	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 167 #######################


> Neighbours evaluated; 63
> Selected Move:	3610	3	8	9	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 168 #######################


> Neighbours evaluated; 66
> Selected Move:	3620	3	7	17	24000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 169 #######################


> Neighbours evaluated; 83
> Selected Move:	3625	3	15	16	26000


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 170 #######################


> Neighbours evaluated; 33
> Selected Move:	3630	2	3	-1	22000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 171 #######################


> Neighbours evaluated; 80
> Selected Move:	3620	3	17	7	23000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 172 #######################


> Neighbours evaluated; 86
> Selected Move:	3570	3	1	3	25000


> New Y[]: 
	
	 2  0  4  3  0  0  0  1  0  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 173 #######################


> Neighbours evaluated; 54
> Selected Move:	3580	3	7	17	24000


> New Y[]: 
	
	 2  0  4  3  0  0  0  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 174 #######################


> Neighbours evaluated; 53
> Selected Move:	3580	4	3	9	21800


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  3  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 175 #######################


> Neighbours evaluated; 72
> Selected Move:	3580	4	9	12	23700


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 176 #######################


> Neighbours evaluated; 58
> Selected Move:	3580	4	12	16	21000


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 177 #######################


> Neighbours evaluated; 71
> Selected Move:	3580	4	16	17	22300


> New Y[]: 
	
	 2  0  4  1  0  0  0  0  0  1  0  0  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,32

## ITERATION 178 #######################


> Neighbours evaluated; 75
> Selected Move:	3570	3	17	7	23000


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  0  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,315

## ITERATION 179 #######################


> Neighbours evaluated; 67
> Selected Move:	3570	4	7	9	22800


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  3  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,31

## ITERATION 180 #######################


> Neighbours evaluated; 70
> Selected Move:	3570	4	9	12	24700


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  1  0  0  3  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 181 #######################


> Neighbours evaluated; 53
> Selected Move:	3570	4	12	16	22000


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  1  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 182 #######################


> Neighbours evaluated; 83
> Selected Move:	3540	3	7	6	21000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  1  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 183 #######################


> Neighbours evaluated; 76
> Selected Move:	3650	3	2	4	23200


> New Y[]: 
	
	 2  0  0  1  4  0  1  0  0  1  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 184 #######################


> Neighbours evaluated; 38
> Selected Move:	3650	4	4	3	24500


> New Y[]: 
	
	 2  0  0  4  1  0  1  0  0  1  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 185 #######################


> Neighbours evaluated; 32
> Selected Move:	3650	4	3	6	23600


> New Y[]: 
	
	 2  0  0  1  1  0  4  0  0  1  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 186 #######################


> Neighbours evaluated; 35
> Selected Move:	3650	4	6	9	23300


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  4  0  0  1  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 187 #######################


> Neighbours evaluated; 39
> Selected Move:	3650	4	9	12	25000


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  1  0  0  4  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 188 #######################


> Neighbours evaluated; 29
> Selected Move:	3650	3	12	5	24900


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  0  1  0  0  0  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 189 #######################


> Neighbours evaluated; 65
> Selected Move:	3630	3	9	10	23400


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  0  0  1  0  0  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 82
> Selected Move:	3630	4	5	4	24200


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  0  0  1  0  0  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 191 #######################


> Neighbours evaluated; 69
> Selected Move:	3630	4	4	6	24600


> New Y[]: 
	
	 2  0  0  1  1  1  4  0  0  0  1  0  0  0  0  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 192 #######################


> Neighbours evaluated; 63
> Selected Move:	3630	4	16	5	24800


> New Y[]: 
	
	 2  0  0  1  1  3  4  0  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 193 #######################


> Neighbours evaluated; 59
> Selected Move:	3630	4	6	4	24400


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 194 #######################


> Neighbours evaluated; 67
> Selected Move:	3630	4	4	5	24500


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  0  0  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 69
> Selected Move:	3630	4	5	16	24600


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  0  0  1  0  0  0  0  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 196 #######################


> Neighbours evaluated; 65
> Selected Move:	3630	4	4	5	23700


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  0  0  1  0  0  0  0  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 197 #######################


> Neighbours evaluated; 80
> Selected Move:	3630	3	5	12	23700


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  0  1  0  3  0  0  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 198 #######################


> Neighbours evaluated; 62
> Selected Move:	3630	4	12	3	24000


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  0  0  1  0  1  0  0  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 199 #######################


> Neighbours evaluated; 53
> Selected Move:	3630	4	3	4	22100


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  0  0  1  0  1  0  0  0  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 200 #######################


> Neighbours evaluated; 59
> Selected Move:	3774	1	-1	15	26600


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  0  0  1  0  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 201 #######################


> Neighbours evaluated; 34
> Selected Move:	3864	4	4	16	26200


> New Y[]: 
	
	 2  0  0  1  4  0  1  0  0  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 202 #######################


> Neighbours evaluated; 52
> Selected Move:	3790	4	4	6	26600


> New Y[]: 
	
	 2  0  0  1  1  0  4  0  0  0  1  0  1  0  0  1  3  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 203 #######################


> Neighbours evaluated; 63
> Selected Move:	3696	3	4	13	26100


> New Y[]: 
	
	 2  0  0  1  0  0  4  0  0  0  1  0  1  1  0  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 204 #######################


> Neighbours evaluated; 57
> Selected Move:	3750	3	16	1	24600


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  0  0  1  0  1  1  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 205 #######################


> Neighbours evaluated; 77
> Selected Move:	3750	4	6	13	24800


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  1  4  0  1  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 206 #######################


> Neighbours evaluated; 76
> Selected Move:	3780	3	13	16	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  0  1  0  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 207 #######################


> Neighbours evaluated; 58
> Selected Move:	3888	3	0	4	26500


> New Y[]: 
	
	 0  3  0  1  2  0  1  0  0  0  1  0  1  0  0  1  4  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18
________________________________________________________________

Best solution found: 4060
Run Termination time: 31.01.2010 11:34:03
Run duration: 00:02:18.9843750
________________________________________________________________
